A new wireless packet scheduling algorithm based on the CDF of user transmission rates

We present a new wireless scheduling algorithm based on the cumulative distribution function (cdf) of user transmission rates and also present a simple modification of it to limit the maximum starving time. This cdf-based scheduling (CS) algorithm selects the user for transmission based on the cdf of user rates in such a way that the user whose rate is high enough but least probable to become higher is selected. It turns out that the cdf-based scheduling algorithm is equivalent to a scheduling algorithm that regards the user rates as independent identically distributed (i.i.d.) and the average throughput of a user is independent of other users’ probability distribution. A distinctive feature of this proposed algorithm is that the exact user throughput can be evaluated if the user’s own distribution is known. The cdf-based scheduling with starving-time limitation (CS-STL) algorithm turns out not to affect the average inter-service time but to limit the maximum starving time at the cost of a negligible throughput loss. Keywords— Multiuser Diversity, wireless scheduling, starving time, inter-service time.